Computation of Kronecker - like Forms of Asystem Pencil : Applications
نویسندگان
چکیده
Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving 0(n 3) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN 77 subroutines to perform the reduction of a system pencil to several Kronecker-like forms.
منابع مشابه
Computation of Kronecker-like Forms of a System Pencil: Applications, Algorithms and Software
Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving 0(n) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN 7...
متن کاملComputation of Kronecker - like forms of periodic matrix pairs
We propose a computationally efficient and numerically reliable algorithm to compute Kronecker-like forms of periodic matrix pairs. The eigenvalues and Kronecker indices are defined via the Kro-necker structure of an associated lifted matrix pencil. The proposed reduction method relies on structure preserving manipulations of this pencil to extract successively lower complexity subpencils which...
متن کاملAn Algorithm for Computing the Staircase Form of aSystem
In this paper we propose a new recursive algorithm for computing the staircase form of a matrix pencil, and implicitly its Kronecker structure. The algorithm compares favorably to existing ones in terms of elegance, versatility, and complexity. In particular, the algorithm without any modiication yields the structural invari-ants associated with a generalized state{space system and its system p...
متن کاملOn computing generalized inverse systems using matrix pencil methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state space representation. We put a particular emphasis on two classes of inverses: the week generalized inverse and the MoorePenrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computa...
متن کاملComputing Generalized Inverse Systems Using Matrix Pencil Methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the MoorePenrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computati...
متن کامل